Nuprl Lemma : pre-init1-p-realizable 11,40

i:Id, X:Type, p:FinProbSpace, x0:XP:(X).
Normal(X es.pre-init1-p(es;i;"x";X;x0;"a";p;P
latex


DefinitionsA, {T}, SQType(T), x:AB(x), P  Q, e'e.P(e'), T, e@iP(e), A c B, pre-init1-p(es;i;x;X;x0;a;p;P), init-p-realizable, Rplus-right(x1), Rplus-left(x1), ff, Rplus?(x1), b, True, Y, reduce(f;k;as), (L), pre-p-realizable, es-realizer(p), t.2, t.1, P & Q, tt, if b then t else f fi , Top, s.x, preinit1R{$x:ut2, $a:ut2}(iXpx0P), xt(x), , t  T, "$x", P  Q, Id, x:AB(x), Dec(P), @i(x:T), (state when e), @i x initially v:T, @i Precondition for a:Outcome(p) is P:State(ds) , Unit, False, R ||- es.P(es), State(ds), es.P(es), Realizer, x(s), Rrframe(loc;x;L), Rbframe(loc;k;L), Raframe(loc;k;L), Rsends(ds;knd;T;l;dt;g), Reffect(loc;ds;knd;T;x;f), Rsframe(lnk;tag;L), Rframe(loc;T;x;L), Rnone(), left  right, Rinit(loc;T;x;v), Rpre(loc;ds;a;p;P),
Lemmasdiscrete-after-elapsed, es-le wf, es-vartype wf, es-le-loc, Id sq, es-after wf, not wf, decidable equal Kind, discrete-init-elapsed, squash wf, es-E wf, es-loc wf, locl wf, es-kind wf, assert wf, R-sub-plus-right3, init-p wf, R-sub-plus-left, decl-type wf, IdLnk wf, Knd wf, rationals wf, unit wf, es realizer wf, false wf, true wf, R-sub-implies, subtype rel self, eqof eq btrue, id-deq wf, fpf-cap-single, fpf-single wf3, pre-p wf, es-real wf, normal-ds wf, decl-state wf, fpf wf, normal-ds-single, Id wf, finite-prob-space wf, bool wf, normal-type wf, R-consistent wf, event system wf, pre-init1-p wf, implies-es-real, preinit1R feasible, preinit1R wf

origin